In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the permutaion flowshop sequencing problem (PFSP) with the objectives of minimizing makespan and maximum lateness of jobs, respectively. Simple but very efficient local search based on variable neighborhood search (VNS) is embedded in the particle swarm optimization algorithm to solve the well known benchmark sui...

We consider the uniform parallel machine scheduling problem with the objective of minimizing maximum lateness. We show that an extension of the EDD rule to a uniform parallel machine setting yields a maximum lateness value which does not exceed the optimal value by more than pmax, where pmax is the maximum job processing time. c © 2000 Elsevier Science B.V. All rights reserved.

We develop an O (q2n + nlogn) algorithm to obtain a preemptive schedule that minimizes maximum lateness when n jobs with given due dates and memory requirements are to be scheduled on m processors (n ≥ m) of given memory sizes. q is the number of distinct due dates. The value of the minimum maximum lateness can itself be found in O(qn + nlogn) time.

This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what order should they be processed on a single machine to minimize maximum lateness? The lateness of a job is defined as its completion time minus its due date. This problem can be solved easily by ordering the jobs in non...

We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem. © 1997 Elsevier Science B.V. Kevwords: Analysis of algorithms; Dynamic programming; Production/scheduling

The objective of this research is to develop and evaluate e€ective, computationally ecient procedures for scheduling jobs in a large-scale manufacturing system involving, for example, over 1000 jobs and over 100 machines. The main performance measure is maximum lateness; and a useful lower bound on maximum lateness is derived from a relaxed scheduling problem in which preemption of jobs is bas...

despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. this paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (mip) models to solve thisproblem. these models have been formulated for the classical single machine problem, namely sequ...